Search results for "binary [neutron star]"
showing 10 items of 544 documents
Vapor−Liquid Equilibria for the Binary Systems Isobutanol with m-Xylene, o-Xylene and p-Xylene at 101.3 kPa
1999
Vapor−liquid equilibria were measured for binary systems of isobutanol with m-xylene, o-xylene, and p-xylene at 101.3 kPa using a recirculating still. The accuracy of experimental measurements was ±0.1 K in temperature, ±0.01 kPa in pressure, and ±0.001 in mole fraction. The results were determined to be thermodynamically consistent according to the point-to-point consistency and Wisniak tests. All the systems show moderate positive deviations from ideality. The data were correlated with five liquid-phase activity coefficient models (Margules, Van Laar, Wilson, NRTL, UNIQUAC).
OPTION VALUE CALCULATION AFFECTED COMPONENTS
2021
As the subprime credit crisis has attracted attention to financial derivative instruments, more frequently arises questions about fairvalue calculations. Over the time, different models had been introduced. All of those models take into account factors affectingprices. Mostly, factors used in calculations on the same type of financial instruments are approximately the same. Therefore questionarises, which factor affects price more and which less, with no matter which model would be used for fair value calculations. One offinancial derivative instrument types is options. Options are agreements, which give to option buyer rights to buy or sell underlyingasset. While the seller or writer of op…
Algebraic and logical characterizations of deterministic linear time classes
1997
In this paper an algebraic characterization of the class DLIN of functions that can be computed in linear time by a deterministic RAM using only numbers of linear size is given. This class was introduced by Grandjean, who showed that it is robust and contains most computational problems that are usually considered to be solvable in deterministic linear time.
Lambda substitution algebras
1993
In the paper an algebraic metatheory of type-free λ-calculus is developed. Our version is based on lambda substitution algebras (λSAs), which are just SAs introduced by Feldman (for algebraizing equational logic) enriched with a countable family of unary operations of λ-abstraction and a binary operation of application. Two representation theorems, syntactical and semantic, are proved, what directly provides completeness theorems.
A constructive semantics for non-deducibility
2008
This paper provides a constructive topological semantics for non-deducibility of a first order intuitionistic formula. Formal topology theory, in particular the recently introduced notion of a binary positivity predicate, and co-induction are two needful tools. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Elementary Action Systems
2015
This chapter expounds basic notions. An elementary action system is a triple consisting of the set of states, the transition relation between states, and a family of binary relations defined on the set of states. The elements of this family are called atomic actions. Each pair of states belonging to an atomic action is a possible performance of this action. This purely extensional understanding of atomic actions is close to dynamic logic. Compound actions are defined as sets of finite sequences of atomic actions. Thus compound actions are regarded as languages over the alphabet whose elements are atomic actions. This chapter is concerned with the problem of performability of actions and the…
On Conditioning Operators
1999
The construction of conditional events (so-called measure-free conditioning) has a long history and is one of the fundamental problems in non-deterministic system theory (cf. [6]). In particular, the iteration of measure-free conditioning is still an open problem. The present paper tries to make a contribution to this question. In particular, we give an axiomatic introduction of conditioning operators which act as binary operations on the universe of events. The corresponding axiom system of this type of operators focus special attention on the intuitive understanding that the event ‘α given β’ is somewhere in “between” ‘α and β’ and ‘β implies α’. A detailed motivation of these axioms can …
On Combinatorial Generation of Prefix Normal Words
2014
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages with the property that, for any word w in the language, exchanging the first occurrence of 01 by 10 in w results in another word in the language. We prove that each prefix normal word is produced in O(n) amortized time, and conjecture, based on expe…
Apparent content curves: description and analytical applications. Resolution of binary mixtures
1992
The apparent content curves and their analytical applications are described. Basing on these curves a mathematical method, which permits the identification of the interfering component present in a binary mixture as well as the determination of the contents of both constituents, is proposed. The existence of considerable interaction coefficients is not an impediment for its application. Besides, the analyte contents in the mixture can be obtained without the use of standard interference solutions. The proposed procedure is applied to the analysis of mixtures of dyes with overlapping absorption spectra.
Principal component analysis for the selection of variables in the application of the H-point and generalised H-point standard addition method
2000
The present paper deals with the selection of variables for the H-point and generalised H-point standard additions methods (HPSAM and GHPSAM, respectively). Both methods are applied for the resolution of spectroscopic interfered signals in the UV-vis range. The HPSAM is a suitable method for the resolution of binary and ternary mixtures when the interferent is known. The GHPSAM is applied for the resolution of samples that contain unknown interferents. In this paper, a method based on the study of a principal components analysis (PCA) for the selection of variables for the HPSAM and GHPSAM is proposed. The PCA results show the isolation of the analyte signal from the sample signal, achieved…